bounding rectangle

bounding rectangle
рабочий [ограничивающий] прямоугольник

English-Russian dictionary of computer science and programming. 2013.

Игры ⚽ Поможем написать реферат

Смотреть что такое "bounding rectangle" в других словарях:

  • Minimum bounding rectangle — The minimum bounding rectangle (MBR), also known as bounding box or envelope, is an expression of the maximum extents of a 2 dimensional object (e.g. point, line, polygon) within its 2 D (x, y) coordinate system, in other words min(x), max(x),… …   Wikipedia

  • Bounding volume — A three dimensional model with its bounding box drawn in dashed lines. For building code compliance, see Bounding. In computer graphics and computational geometry, a bounding volume for a set of objects is a closed volume that completely contains …   Wikipedia

  • Rectangle à limite minimum — Le Rectangle à limite minimum (« minimum bounding rectangle (MBR) »), connu aussi sous le nom de boite limite ou enveloppe, est l expression de l extension maximum d un objet bi dimensionnel (i.e. point, ligne, polygone) dans un système …   Wikipédia en Français

  • Minimum bounding box — The minimum or smallest bounding or enclosing box for a point set in N dimensions is the box with the smallest measure (area, volume, or hypervolume in higher dimensions) within which all the points lie. When other kinds of measure are used, the… …   Wikipedia

  • Minimum bounding box algorithms — In computational geometry, the smallest enclosing box problem is that of finding the oriented minimum bounding box enclosing a set of points. It is a type of bounding volume. Smallest may refer to volume, area, perimeter, etc. of the box. It is… …   Wikipedia

  • R-tree — R trees are tree data structures that are similar to B trees, but are used for spatial access methods i.e., for indexing multi dimensional information; for example, the (X, Y) coordinates of geographical data. A common real world usage for an R… …   Wikipedia

  • List of combinatorial computational geometry topics — enumerates the topics of computational geometry that states problems in terms of geometric objects as discrete entities and hence the methods of their solution are mostly theories and algorithms of combinatorial character.See List of numerical… …   Wikipedia

  • Scene graph — A scene graph is a general data structure commonly used by vector based graphics editing applications and modern computer games. Examples of such programs include AutoCAD, Adobe Illustrator, Acrobat 3D, OpenSceneGraph and CorelDRAW.The scene… …   Wikipedia

  • Rectilinear polygon — Some examples of rectilinear polygons A rectilinear polygon is a polygon all of whose edges meet at right angles. Thus the interior angle at each vertex is either 90° or 270°. Rectilinear polygons are a special case of isothetic polygons. In many …   Wikipedia

  • C-squares — (acronym for the concise spatial query and representation system ) is a system of geocodes (actually a type of global grid) that provides a basis for simple spatial indexing of geographic features or data. It was devised by Tony Rees of CSIRO… …   Wikipedia

  • Structures de données dans un SIG — Un Système d information géographique contient des données alphanumériques et des données spatiales. Dans un SIG, les données sont stockées soit sous format vectoriel, soit sous format raster[1],[2]. Le format vectoriel gère les points, les… …   Wikipédia en Français

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»